An Efficient Evolutionary Metaheuristic for the Traveling Repairman (Minimum Latency) Problem
نویسندگان
چکیده
منابع مشابه
Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملThe Dynamic Traveling Repairman Problem
We propose and analyze a generic mathematical model for dynamic vehicle routing problems, which we call the dynamic traveling repairman problem (DTRP). The model is motivated by applications in which the objective is minimizing the wait for service in a stochastic and dynamically changing environment. This is a departure from traditional vehicle routing problems which seek to minimize total tra...
متن کاملA simple and effective metaheuristic for the Minimum Latency Problem
The Minimum Latency Problem (MLP) is a variant of the Traveling Salesman Problem which aims to minimize the sum of arrival times at vertices. The problem arises in a number of practical applications such as logistics for relief supply, scheduling and data retrieval in computer networks. This paper introduces a simple metaheuristic for the MLP, based on a greedy randomized approach for solution ...
متن کاملNew Formulations for the Traveling Repairman Problem
Given a complete directed graph G = (V,E), the traveling repairman problem consists of determining a Hamiltonian circuit minimizing the sum of the waiting times of customers located at the nodes of the graph. In this paper, we propose two new linear integer formulations for TRP and computationally evaluate the strength of their linear programming relaxations. Computational results show the effi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2020
ISSN: 1875-6883
DOI: 10.2991/ijcis.d.200529.001